Iterative algorithms for semi-linear quasi complementarity problems

Improved infeasible-interior-point algorithm for linear complementarity problems

We present a modified version of the infeasible-interior- We present a modified version of the infeasible-interior-point algorithm for monotone linear complementary problems introduced by Mansouri et al. (Nonlinear Anal. Real World Appl. 12(2011) 545--561). Each main step of the algorithm consists of a feasibility step and several centering steps. We use a different feasibility step, which tar...

Iterative Regularized Solution of Symmetric and Positive Semi-Definite Linear Complementarity Problems

In this report an iterative method from the theory of maximal monotone operators is transfered into the context of linear complementarity problems and numerical tests are performed on contact problems from the field of rigid multibody dynamics.

Infeasible path following algorithms for linear complementarity problems

Polynomial Interior Point Algorithms for General Linear Complementarity Problems

Linear Complementarity Problems (LCPs) belong to the class of NP-complete problems. Therefore we can not expect a polynomial time solution method for LCPs without requiring some special property of the coefficient matrix. Following our recently published ideas we generalize affine scaling and predictor-corrector interior point algorithms to solve LCPs with general matrices in EP-sense, namely, ...

Interior point algorithms for general linear complementarity problems